On the combinatorics of Galois numbers
نویسندگان
چکیده
Ulrich Faigle asked whether this has an immediate combinatorial interpretation in the following sense: Is it always possible to partition the lattice of subspaces of GF (q) into two intervals of length n− 1 and (qn−1 − 1) intervals of length n− 2, for n ≥ 2? We show that such an interval decomposition of the lattice of subspaces of a finite-dimensional vector space exists if and only if there exists a family of linear forms with certain properties. As applications we prove that all finite-dimensional real vector spaces admit an interval decomposition while GF (2) has an interval decomposition if and only if n ≤ 4. This partially answers the question of Faigle to the negative. On the other hand we present an interval decomposition of GF (3) and further results we found using a computer.
منابع مشابه
A History of Selected Topics in Categorical Algebra I: From Galois Theory to Abstract Commutators and Internal Groupoids
This paper is a chronological survey, with no proofs, of a direction in categorical algebra, which is based on categorical Galois theory and involves generalized central extensions, commutators, and internal groupoids in Barr exact Mal’tsev and more general categories. Galois theory proposes a notion of central extension, and motivates the study of internal groupoids, which is then used as an a...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملGalois Groups of Schubert Problems of Lines Are at Least Alternating
We show that the Galois group of any Schubert problem involving lines in projective space contains the alternating group. This constitutes the largest family of enumerative problems whose Galois groups have been largely determined. Using a criterion of Vakil and a special position argument due to Schubert, our result follows from a particular inequality among Kostka numbers of two-rowed tableau...
متن کاملDouble Roman domination and domatic numbers of graphs
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010